An efficient condition for a graph to be Hamiltonian
نویسندگان
چکیده
منابع مشابه
An efficient condition for a graph to be Hamiltonian
LetG= (V ,E) be a 2-connected simple graph and let dG(u, v) denote the distance between two vertices u, v in G. In this paper, it is proved: if the inequality dG(u) + dG(v) |V (G)| − 1 holds for each pair of vertices u and v with dG(u, v) = 2, then G is Hamiltonian, unless G belongs to an exceptional class of graphs. The latter class is described in this paper. Our result implies the theorem of...
متن کاملA Forbidden Subdigraph Condition Implying an Oriented Graph to Be Hamiltonian
In this note we prove that a strong oriented graph of order at least 3 without containing an induced subdigraph of a set of seven 4?order oriented graphs is Hamiltonian. We apply a technique introduced by Bondy and Thomassen.
متن کاملA balanced independence number condition for a balanced bipartite graph to be Hamiltonian
Let G be a 2-connected balanced bipartite graph with partite sets X1 and X2. We denote α∗ BIP (G) be the maximum cardinality of an independent set A1∪A2 of G such that A1 ⊂ X1, A2 ⊂ X2 and ∣∣|A1| − |A2|∣∣ ≤ 1. In this paper, we prove that if α∗ BIP (G) ≤ 2δ(G)− 2, then G is Hamiltonian. This condition is best possible, and this implies several known results, for example, in [1, 6, 7, 11]. Also ...
متن کاملA New Sufficient Condition for a Digraph to Be Hamiltonian
In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...
متن کاملA necessary condition for a Shearlet system to be a frame via admissibility
Necessary conditions for shearlet and cone-adapted shearlet systems to be frames are presented with respect to the admissibility condition of generators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.03.013